A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure

نویسندگان

  • Gou Hosoya
  • Toshiyasu Matsushima
  • Shigeichi Hirasawa
چکیده

A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we show that the critical minimum span ratio of stopping sets for the proposed code ensemble is better than that of the conventional one with keeping the same critical exponent of stopping ratio for both ensemble. Furthermore from experimental results, we show that the average minimum span of stopping sets for a solid burst erasure of the proposed codes is larger than that of the conventional ones. key words: low-density parity-check code, solid burst erasure, stopping set, minimum span, belief-propagation decoding

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modification Method for Constructing Low-Density Parity-Check Codes for Burst Erasures

We study a modification method for constructing lowdensity parity-check (LDPC) codes for solid burst erasures. Our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random erasure channels. We show by simulation results t...

متن کامل

Performance of Low-Density Parity-Check Codes for Burst Erasure Channels

Performance of low-density parity-check (LDPC) codes with maximum likelihood decoding (MLD) for solid burst erasures is discussed. The columns of the paritycheck matrix of LDPC codes are permuted to increase the distance between elements (DBEs) which are defined as a number of symbol positions between elements 1 at each row of the parity-check matrix. The column permutation method can change th...

متن کامل

Burst Correction Coding From Low-Density Parity-Check Codes

BURST CORRECTION CODING FROM LOW-DENSITY PARITY-CHECK CODES Wai Han Fong, PhD George Mason University, 2015 Dissertation Director: Dr. Shih-Chun Chang Dissertation Co-Director: Dr. Shu Lin This thesis explores techniques and theoretical bounds on efficiently encodable low-density parity-check (LDPC) codes for correcting single and multiple bursts of erasures and/or errors. The approach is to co...

متن کامل

On the erasure-correcting capabilities of low-complexity decoded LDPC codes with constituent Hamming codes

Low-density parity-check (LDPC) codes can be constructed using constituent block codes other than single parity-check (SPC) codes. This paper considers random LDPC codes with constituent Hamming codes and investigates their asymptotic performance over the binary erasure channel. It is shown that there exist Hamming code-based LDPC codes which, when decoded with a low-complexity iterative algori...

متن کامل

A Lower Bound for Codes Correcting Low Density Closed-Loop Burst

In this paper, we present a lower bound for low density closed loop burst error correcting code in two sub-blocks of length 1 n and 2 n of the total code length 1 2 ( ) n n n n   . Keywords-Open loop burst, Closed loop burst, Parity check matrix,Syndromes, Error correction.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 91-A  شماره 

صفحات  -

تاریخ انتشار 2008